cospectrality measures of graphs with at most six vertices

cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. actually,the origin of this concept came back to richard brualdi's problems that are proposed in cite{braldi}:let $g_n$ and $g'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2 geq cdots geq lambda'_n,$$respectively. define the distance between the spectra of $g_n$ and $g'_n$ as$$lambda(g_n,g'_n) =sum_{i=1}^n (lambda_i-lambda'_i)^2 ;;; big(text{or use}; sum_{i=1}^n|lambda_i-lambda'_i|big).$$define the cospectrality of $g_n$ by$text{cs}(g_n) = min{lambda(g_n,g'_n) ;:; g'_n ;;text{not isomorphic to} ; g_n}.$let $text{cs}_n = max{text{cs}(g_n) ;:; g_n ;;text{a graph on}; n ;text{vertices}}.$investigation of $text{cs}(g_n)$ for special classes of graphs and finding a good upper bound on $text{cs}_n$ are two main questions in thissubject.in this paper, we briefly give some important results in this direction and then we collect all cospectrality measures of graphs with at most six vertices with respect to three norms. also, we give the shape of all graphs that are closest (with respect to cospectrality measure) to a given graph $g$.